Compositional verification for reactive multi-agent systems applied to platoon non collision verification

نویسندگان

  • Madeleine El-Zaher
  • Jean-Michel Contet
  • Pablo Gruer
  • Franck Gechter
  • Abder Koukam
چکیده

This paper presents a methodology for the verification of reactive multi-agent systems (RMAS). High level of confidence about a safe operation is a mandatory in many reactive applications. Model-checking appear as an adequate tool for the verification of safety properties. However, model-checking can be confronted with the problem of intractable state space sizes. To avoid this kind of limitation, it is possible to apply verification methods based on abstraction or composition. This paper presents a compositional verification method adapted to a wide range of RMAS applications. This method is appropriate for the verification of safety properties. The application considered in this paper is a platoon of vehicles with linear configuration. The safety property to be verified is the non collision between platoon vehicles. The SAL tool-kit has been adopted as a verification tool, by applying SAL model checkers. The verification method bases on a compositional verification rule.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a compositional verification approach for multi-agent systems : Application to Platoon system

Résumé. This paper presents a methodology for the verification of reactive multi-agent systems (RMAS). High level of confidence about a safety execution is a must in such systems. For this reason, model-checking appear as an adequate tool to the verification of such models. However, model-checking can be confronted with the problem of huge state space exploration. To avoid this kind of inconven...

متن کامل

Towards Validating a Platoon of Cristal Vehicles Using CSP||B

The complexity of specification development and verification of large systems has to be mastered. In this paper a specification of a real case study, a platoon of Cristal vehicles is developed using the combination, named CSP‖B, of two well-known formal methods. This large – both distributed and embedded – system typically corresponds to a multi-level composition of components that have to coop...

متن کامل

Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic

Compositional verification aims at managing the complexity of the verification process by exploiting compositionality of the system architecture. In this paper we explore the use of a temporal epistemic logic to formalize the process of verification of compositional multi-agent systems. The specification of a system, its properties and their proofs are of a compositional nature, and are formali...

متن کامل

Partial Unfolding for Compositional Nonblocking Verification of Extended Finite-state Machines

This working paper describes a framework for compositional nonblocking verification of reactive systems modelled as extended finite-state machines. The nonblocking property can capture the absence of livelocks and deadlocks in concurrent systems. Compositional verification is shown in previous work to be effective to verify this property for large discrete event systems. Here, these results are...

متن کامل

Compositional Design and Verification of a Multi-Agent System for One-to-Many Negotiation

A compositional verification method for multi-agent systems is presented and applied to a multi-agent system for one-to-many negotiation in the domain of load balancing of electricity use. Advantages of the method are that the complexity of the verification process is managed by compositionality, and that parts of the proofs can be reused in relation to reuse of components.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Stud. Inform. Univ.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2012